Parts · Full · Next ▶

top

In mathematics and computing, a triangular array of numbers, polynomials, or the like, is a doubly indexed sequence in which each row is only as long as the row's own index. That is, the ith row contains only i elements.

• Examples

• Generalizations

• Applications

• Indexing

• See also

• References

• External links

Notable particular examples include these:

• The Bell triangle, whose numbers count the partitions of a set in which a given element is the largest singletoncite-ref-1[1]

• Catalan's triangle, which counts strings of matched parenthesescite-ref-2[2]

• Euler's triangle, which counts permutations with a given number of ascentscite-ref-3[3]

• Floyd's triangle, whose entries are all of the integers in ordercite-ref-4[4]

Parts · Full · Next ▶